#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
ll num[6];
ll ans;
ll a[12]={0,1,2,3,4,5,6,7,8,9,10,11};
ll next_s[4][2]={0,1,0,-1,1,0,-1,0};
map<ll,bool> mp;
bool judge(ll i){
    ll x=i/4;
    ll y=i%4;
    for(ll k=0;k<4;k++){
        ll tx=x+next_s[k][0];
        ll ty=y+next_s[k][1];
        for(ll j=1;j<=5;j++){
            if(i==j)continue;
            if(tx*4+ty==num[j])return true;
        }
    }
    return false;
}

void dfs(ll id,ll cnt){
    if(cnt>=5){
        sort(num+1,num+6);
        ll sum=num[1]*10000+num[2]*1000+num[3]*100+num[4]*10+num[5];
        if(mp[sum])return ;
        else mp[sum]=true;
        ll i;
        for(i=1;i<=5;i++){
            if(judge(i))continue;
            else  break;
        }
        if(i>5)ans++;
        return ;
    }
    for(ll i=id;i<12;i++){
        swap(a[i],a[id]);
        num[cnt+1]=a[id];
        dfs(id+1,cnt+1);
        swap(a[i],a[id]);
        // if(12-i+cnt<5)return ;
        // num[cnt+1]=i;
        // dfs(id+1,cnt+1);
        // dfs(id+1,cnt);
    }
    return ;
}

int main()
{
    IOS;
    // dfs(0,0); 
    // cout<<ans<<endl;   
    cout<<64<<endl;
    getchar();
    getchar();
    return 0;
}
